The K-coverage concentrator location problem
نویسندگان
چکیده
منابع مشابه
A new approach for a restricted concentrator location problem
In any network where a large number of widely dispersed \users" share a limited number of \resources", the strategy for access will play a large part in determining the cost and performance of the network. The users may include time-sharing terminals, terminals used for message transfers, remote automatic sensing devices (such as might be found in an environment-monitoring situation), manned se...
متن کاملInteger Programming Model and Exact Solution for Concentrator Location Problem
Topological design of centralized computer networks is an important problem that has been investigated by many researchers. Such networks typically involve a large number of terminals connected to concentrators, that are then connected to a central computing site. This paper focuses on the concentrator location problem among general topological network design problems. The concentrator location...
متن کاملAlgorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks
Abstract. An important issue in deploying a wireless sensor network (WSN) is to provide target coverage with high energy efficiency and faulttolerance. In this paper, we study the problem of constructing energy-efficient and fault-tolerant target coverage with the minimal number of active nodes which form an m-coverage for targets and a k-connected communication subgraph. We propose two heurist...
متن کاملCapacitated Facility Location Problem with Variable Coverage Radius in Distribution System
The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective intege...
متن کاملA New Approximation Algorithm for the k-Facility Location Problem
The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + √ 3 + ǫ-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1992
ISSN: 0307-904X
DOI: 10.1016/0307-904x(92)90086-i